Symbolic Trajectories in SECONDO: Pattern Matching and Rewriting
نویسندگان
چکیده
In this paper, we introduce a novel data model for representing symbolic trajectories along with a pattern language enabling both the matching and the rewriting of trajectories. We illustrate in particular the trajectory data type and two operations for querying symbolic trajectories inside the database system Secondo. As an important application of our theory, the classification and depiction of a set of real trajectories according to several criteria is demonstrated.
منابع مشابه
Algebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملMatchPy: A Pattern Matching Library
Pattern matching is a powerful tool for symbolic computations, based on the well-defined theory of term rewriting systems. Application domains include algebraic expressions, abstract syntax trees, and XML and JSON data. Unfortunately, no lightweight implementation of pattern matching as general and flexible as Mathematica exists for Python [Pö16], [Hao14], [Sch14], [Jen15]. Therefore, we create...
متن کاملSubtree matching by pushdown automata
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term-rewriting, symbolic computation and nonprocedural programming languages are based on. A systematic approach to the construction of subtree pattern matchers by deterministic pushdown automata, which read subject trees in prefix and postfix notation, is presented. The ...
متن کاملSymbolic computation in software science: Foreword from the editor
The series of workshops on Symbolic Computation in Software Science has been initiated by the research groups of Bruno Buchberger at RISC, Johannes Kepler University of Linz, Tetsuo Ida at the University of Tsukuba, and Masahiko Sato at Kyoto University. As the name suggests, the focus of the series is on applications of symbolic computation techniques in various areas of software science. The ...
متن کاملExpressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and the λ-calculus. The combination of these two latter formalisms has been already handled either by enriching first-order rewriting with higher-order capabilities, like in the Combinatory Reduction Systems (crs), or by adding to t...
متن کامل